The Bin Scheduling Problem
نویسندگان
چکیده
We consider a natural generalization of multiprocessor scheduling, the bin scheduling problem. Here, we model the situation in which working resources are available during separate time windows, or shifts, only. Restricting to scheduling without job preemption, every task must be processed completely during one shift. Our aim is to find a feasible schedule in which the number of required shifts is minimized. This generalization corresponds to an analogous relationship between strip packing and twodimensional bin packing (see [4]) as demonstrated in Figure 1. This work is based on results from the comprehensive study of bin scheduling in [2].
منابع مشابه
An Application of Bin-Packing to Multiprocessor Scheduling
Processing Time first algorithm always finds a schedule having makespan within 43 1. Key words, bin packing, multiprocessor scheduling, approximation.Single capacity bin-packing algorithms were applied to solve this problem. Available system resources, the scheduling algorithm must be able to maintain a job working set. Bounds for multiprocessor scheduling with resource.We consider a natural ge...
متن کاملCollection and recycle bin location-allocation problem in solid waste management: A review
This comprehensive work explores the research performed inoptimization of the collection bin and in recycle bin location-allocation issues in solidwaste management. Although the collection phase of solid waste management accountsfor a significant proportion of the municipal budget, it has attracted only limitedattention of the researchers. Optimization of the collection bin and recycle bin loca...
متن کاملThe complexity of scheduling TV commercials (draft version)
Television commercial scheduling is a generalised form of bin-packing problem, but the bins are rather small, leaving the complexity of the problem unclear. This paper shows that if spot-fixing is allowed, then the problem is NP-complete, even when the breaks are short (polynomially bounded). We also show that scheduling unit-length spots is easy. The paper also aims to provide a fairly simple ...
متن کاملExtending Two-Dimensional Bin Packing Problem: Consideration of Priority for Items
In this paper a two-dimensional non-oriented guillotine bin packing problem is studied when items have different priorities. Our objective is to maximize the total profit which is total revenues minus costs of used bins and wasted area. A genetic algorithm is developed to solve this problem where a new coding scheme is introduced. To evaluate the performance of the proposed GA, first an upper b...
متن کاملA hybrid improvement heuristic for the bin-packing problem and its application to the multiprocessor scheduling problem
This work presents a hybrid improvement procedure for the bin packing problem and its application to the multiprocessor scheduling problem. This heuristic has several features: a new lower bound; reductions; initial solutions by reference to the dual problem; heuristics for load redistribution, and an improvement process utilizing tabu search. It improved the best known solutions for many of th...
متن کامل